Nontrivial definability by flow-chart programs
نویسندگان
چکیده
منابع مشابه
Definability by Programs in First-Order Structures
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ti 1. Preliminarv detinitilms and results . . . . . . . . . . . . . . . . . . . . . . . . . Algebraic characterizations of the unwind property .................. A structure with the unwind property for every iterative (but not every recursive 1 program . The truth-table property ............................. Struc...
متن کاملLoop-separable programs and their first-order definability
An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence. Characterizing classes of programs that are first-order definable on finite structures is theoretically challenging and of practical relevance to Answer Set Programming. In this paper, we identify a non-trivial class of answer set pro...
متن کاملProving sequential function chart programs using timed automata
Applications described by Sequential Function Chart (SFC) often being critical, we have investigated the possibilities of program checking. In particular, physical time can be handled by SFC programs using temporisations, which is why we are interested in the quantitative temporal properties. We have proposed a modeling of SFC in timed automata, a formalism which takes time into account. In thi...
متن کاملImproving Model Counting by Leveraging Definability
We present a new preprocessing technique for propositional model counting. This technique leverages definability, i.e., the ability to determine that some gates are implied by the input formula ⌃. Such gates can be exploited to simplify ⌃ without modifying its number of models. Unlike previous techniques based on gate detection and replacement, gates do not need to be made explicit in our appro...
متن کاملDeciding Definability by Deterministic Regular Expressions
We investigate the complexity of deciding whether a given regular language can be defined with a deterministic regular expression. Our main technical result shows that the problem is PSPACE-complete if the input language is represented as a regular expression or nondeterministic finite automaton. The problem becomes EXPSPACE-complete if the language is represented as a regular expression with c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1983
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(83)80057-6